Computing Optimal Strategies to Commit to in Stochastic Games
نویسندگان
چکیده
Significant progress has been made recently in the following two lines of research intersection AI and game theory: (1) computation optimal strategies to commit (Stackelberg strategies), (2) correlated equilibria stochastic games. In this paper, we unite these by studying Stackelberg We provide theoretical results on value being able correlate, as well complexity about computing then modify QPACE algorithm (MacDermed et al. 2011) compute strategies, experimental results.
منابع مشابه
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit to (Stackelberg strategies), and (2) the computation of correlated equilibria of stochastic games. In this paper, we unite these two lines of research by studying the computation of Stackelberg strategies in stochastic ...
متن کاملComputing Uniformly Optimal Strategies in Two-Player Stochastic Games
We provide a computable algorithm to calculate uniform ε-optimal strategies in two-player zero-sum stochastic games. Our approach can be used to construct algorithms that calculate uniform ε-equilibria and uniform correlated ε-equilibria in various classes of multi-player non-zero-sum stochastic games. JEL codes: C63, C73.
متن کاملOptimal Machine Strategies to Commit to in Two-Person Repeated Games
The problem of computing optimal strategy to commit to in various games has attracted intense research interests and has important real-world applications such as security (attacker-defender) games. In this paper, we consider the problem of computing optimal leader’s machine to commit to in two-person repeated game, where the follower also plays a machine strategy. Machine strategy is the gener...
متن کاملOptimal Machine Strategy to Commit to in Two-Person Repeated Games
The problem of computing optimal strategy to commit to in various games has attracted intense research interests and has important real-world applications such as security (attacker-defender) games. In this paper, we consider the problem of computing optimal leader’s machine to commit to in two-person repeated game, where the follower also plays a machine strategy. Machine strategy is the gener...
متن کاملDeterminacy and optimal strategies in infinite-state stochastic reachability games
We consider perfect-information reachability stochastic games for 2 players on infinite graphs. We identify a subclass of such games, and prove two interesting properties of it: first, Player Max always has optimal strategies in games from this subclass, and second, these games are strongly determined. The subclass is defined by the property that the set of all values can only have one accumula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v26i1.8267